منابع مشابه
Annotation Theories over Finite Graphs
In the current paper we consider theories with vocabulary containing a number of binary and unary relation symbols. Binary relation symbols represent labeled edges of a graph and unary relations represent unique annotations of the graph’s nodes. Such theories, which we call annotation theories, can be used in many applications, including the formalization of argumentation, approximate reasoning...
متن کاملAlgebraic Cayley graphs over finite fields
Article history: Received 6 April 2013 Received in revised form 23 January 2014 Accepted 25 January 2014 Available online xxxx Communicated by Igor Shparlinski MSC: 11L40 05C75 05C50
متن کاملSpectra of Heisenberg Graphs over Finite Rings
We investigate spectra of Cayley graphs for the Heisenberg group over Þnite rings Z/pZ, where p is a prime. Emphasis is on graphs of degree four. We show that for odd p there is only one such connected graph up to isomorphism. When p = 2, there are at most two isomorphism classes. We study the spectra using representations of the Heisenberg group. This allows us to produce histograms and butter...
متن کاملToroidal queens graphs over finite fields
For each positive integer n, the toroidal queens graph may be described as a graph with vertex set Zn × Zn where every vertex is adjacent to those vertices in the directions (1, 0), (0, 1), (1, 1), (1,−1) from it. We here extend this idea, examining graphs with vertex set F × F , where F is a finite field, and any four directions are used to define adjacency. The automorphism groups and isomorp...
متن کاملFunctional graphs of polynomials over finite fields
Given a function f in a finite field IFq we define the functional graph of f as a directed graph on q nodes labelled by elements of IFq where there is an edge from u to v if and only if f(u) = v. We obtain some theoretic estimates on the number of non-isomorphic graphs generated by all polynomials of a given degree. We then develop an algorithm to test the isomorphism of quadratic polynomials t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Logica
سال: 2009
ISSN: 0039-3215,1572-8730
DOI: 10.1007/s11225-009-9220-3